Information compression based on principal component analysis: from one-order to higher-order
نویسندگان
چکیده
منابع مشابه
Sparse Higher-Order Principal Components Analysis
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor data in areas such as neuroimaging, microscopy, chemometrics, and remote sensing. Sparsity in high-dimensional matrix factorizations and principal components has been well-studied exhibiting many benefits; less attentio...
متن کاملCompression of Breast Cancer Images By Principal Component Analysis
The principle of dimensionality reduction with PCA is the representation of the dataset ‘X’in terms of eigenvectors ei ∈ RN of its covariance matrix. The eigenvectors oriented in the direction with the maximum variance of X in RN carry the most relevant information of X. These eigenvectors are called principal components [8]. Ass...
متن کاملCompression of Breast Cancer Images By Principal Component Analysis
The principle of dimensionality reduction with PCA is the representation of the dataset ‘X’in terms of eigenvectors ei ∈ RN of its covariance matrix. The eigenvectors oriented in the direction with the maximum variance of X in RN carry the most relevant information of X. These eigenvectors are called principal components [8]. Ass...
متن کاملModal Characterization using Principal Component Analysis: application to Bessel, higher-order Gaussian beams and their superposition
The modal characterization of various families of beams is a topic of current interest. We recently reported a new method for the simultaneous determination of both the azimuthal and radial mode indices for light fields possessing orbital angular momentum. The method is based upon probing the far-field diffraction pattern from a random aperture and using the recorded data as a 'training set'. W...
متن کاملFrom Higher-Order to First-Order Rewriting
We show how higher-order rewriting may be encoded into rst-order rewriting modulo an equational theory E. We obtain a characterization of the class of higher-order rewriting systems which can be encoded by rst-order rewriting modulo an empty theory (that is, E = ;). This class includes of course the-calculus. Our technique does not rely on a particular substitution calculus but on a set of abst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Informationis
سال: 2018
ISSN: 1674-7267
DOI: 10.1360/n112017-00238